From Basic Logic to Quantum Logics with Cut-elimination
نویسندگان
چکیده
The results presented in this paper were born in the framework of basic logic, a new logic aiming at the uniication of several logical systems. The rst result is a sequent formulation for orthologic which allows to use methods of proof theory in quantum logic. Such formulation admits a very simple procedure of cut-elimination and hence, because of the subformula property, also a method of proof search and an eeective decision procedure. By using the framework of basic logic, we also obtain a cut-free formulation for orthologic with implication, for linear orthologic and, more in general, for a wide range of new quantum-like logics. These logics meet some requirements expressed by physicists and computer scientists. In particular, we propose a good candidate for a linear quantum logic with implication.
منابع مشابه
EQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملBasic Logic: Reeection, Symmetry, Visibility
We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to nd a structure in the space of logics. Classical, intuitionistic, quantum and non-modal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate three properties, which characterize B positively: reeection, symmetry and visibility. A logical constant obe...
متن کاملBasic Logic: Reflection, Symmetry, Visibility
We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and non-modal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate three properties, which characterize B positively: reflection, symmetry and visibility. A logical constant ...
متن کاملClassical Proofs via Basic Logic
Cut-elimination, besides being an important tool in proof-theory, plays a central role in the proofs-as-programs paradigm. In recent years this approach has been extended to classical logic (cf. Girard 1991, Parigot 1991, and recently Danos Joinet Schellinx 1997). This paper introduces a new sequent calculus for (propositional) classical logic, indicated by ? C. Both, the calculus and the cut-e...
متن کاملGeneric Modal Cut Elimination Applied to Conditional Logics
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide variety of logics outside the realm of normal modal logic. We give extensive example instantiations of our framework to various conditional lo...
متن کامل